Nondeterministic circuits, space complexity and quasigroups
نویسندگان
چکیده
منابع مشابه
Quantum Weakly Nondeterministic Communication Complexity
In this paper, we study a weak version of quantum nondeterministic communication complexity, corresponding to the most natural generalization of classical nondeterminism, in which a classical proof has to be checked with probability one by a quantum protocol. Another stronger definition of quantum nondeterminism has already been extensively studied, corresponding to the view of quantum nondeter...
متن کاملThe Complexity of Computing over Quasigroups
In 7] the notions of recognition by semigroups and by programs over semigroups were extended to groupoids. This led to a new characterization of the context-free languages and the class SAC 1. In this paper, we investigate the classes of languages obtained when the groupoids are restricted to be quasigroups (i.e. the multiplication table forms a latin square). We prove that languages recognized...
متن کاملNondeterministic Biautomata and Their Descriptional Complexity
Biautomata were recently introduced in [4] as a generalization of ordinary deterministic finite automata. A biautomaton consists of a deterministic finite control, a read-only input tape, and two reading heads, one reading the input from left to right, and the other head reading the input from right to left. An input word is accepted by a biautomaton, if there is an accepting computation starti...
متن کاملNL-printable sets and nondeterministic Kolmogorov complexity
P-printable sets were defined by Hartmanis and Yesha and have been investigated by several researchers. The analogous notion of Lprintable sets was defined by Fortnow et al; both P-printability and L-printability were shown to be related to notions of resource-bounded Kolmogorov complexity. NL-printability was defined by Jenner and Kirsig, but some basic questions regarding this notion were lef...
متن کاملLower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes
Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them, typically the planar versions of many NP-complete problems are recognized by nondeterministic RAMs in linear time and sublinear space. The main results of this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)00014-i